BDDC and FETI-DP under minimalist assumptions
نویسندگان
چکیده
منابع مشابه
Nonlinear FETI-DP and BDDC Methods
New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...
متن کاملFETI–DP, BDDC, and Block Cholesky Methods
Two popular non-overlapping domain decomposition methods, the FETI–DP and BDDC algorithms, are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal conti...
متن کاملFETI-DP Domain Decomposition Method
School of Basic Science Mathematics Section Master in Mathematical Engineering FETI-DP Domain Decomposition Method by Christoph Jäggli FETI-DP is a dual iterative, nonoverlapping domain decomposition method. By a Schur complement procedure, the solution of a boundary value problem is reduced to solving a symmetric and positive definite dual problem in which the variables are directly related to...
متن کاملAdaptive Coarse Space Selection in the BDDC and the FETI-DP Iterative Substructuring Methods: Optimal Face Degrees of Freedom
We propose adaptive selection of the coarse space of the BDDC and FETI-DP iterative substructuring methods by adding coarse degrees of freedom (dofs) on faces between substructures constructed using eigenvectors associated with the faces. Provably the minimal number of coarse dofs on the faces is added to decrease the condition number estimate under a target value specified a priori. It is assu...
متن کاملAdaptive Selection of Face Coarse Degrees of Freedom in the BDDC and the FETI-DP Iterative Substructuring Methods
We propose a class of method for the adaptive selection of the coarse space of the BDDC and FETI-DP iterative substructuring methods. The methods work by adding coarse degrees of freedom constructed from eigenvectors associated with intersections of selected pairs of adjacent substructures. It is assumed that the starting coarse degrees of freedom are already sufficient to prevent relative rigi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2007
ISSN: 0010-485X,1436-5057
DOI: 10.1007/s00607-007-0254-y